Simulation of Scattered Context Grammars and Phrase-Structured Grammars by Symbiotic E0L Grammars
نویسنده
چکیده
This paper contains more examples to formerly introduced concept of formal language equivalency. That is, for two models, there is a substitution by which we change each string of every yield sequence in one model so that sequence ofs string resulting from this change represents a yield sequence in the other equvalent model, these two models closely simulates each other; otherwise they do not. In this paper are shown two cases of such simulations.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملFormal Properties of Feature Grammars
This paper describes the formal power of feature grammars such as Generalised Phrase Structured Grammars (GPSG) 1]. It shows how such grammars relate to context-free grammar (Chomsky type 2) and which extensions cause the formalism to increase in power to context-sensitive grammar and beyond. Also, it describes how any Turing machine can be implemented as a feature grammar showing that the powe...
متن کاملFinite-State Approximation of Phrase Structure Grammars
Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state models are used instead, even though they lack expressive power. To reconcile those two alternatives, we designed an algorithm to compute finite-state approxi...
متن کاملAccepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملSynchronous Formal Systems Based on Grammars and Transducers
This paper is an extended abstract of a doctoral thesis which studies synchronous formal systems based on grammars and transducers, investigating both theoretical properties and practical application perspectives. It introduces new concepts and definitions building upon the well-known principles of regulated rewriting and synchronization. An alternate approach to synchronization of context-free...
متن کامل